How to obtain sharp threshold functions for the random intersection graph via coupling method?
نویسنده
چکیده
We will present a new method, which enables us to find threshold functions for many properties in random intersection graphs. This method will be used to establish sharp threshold functions in random intersection graphs for k–connectivity, perfect matching containment and Hamilton cycle containment. keywords: random intersection graph, threshold functions, connectivity, Hamilton cycle, perfect matching, coupling
منابع مشابه
Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method
We present a new method which enables us to find threshold functions for many properties in random intersection graphs. This method is used to establish sharp threshold functions in random intersection graphs for k–connectivity, perfect matching containment and Hamilton cycle containment.
متن کاملThe Coupling Method for Inhomogeneous Random Intersection Graphs
We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we improve and generalize the coupling method introduced for random intersection graphs so that it may be used for a wider range of parameters. Using the new approach we are able to tighten the best known results concerning random intersection graphs and establish threshold functio...
متن کاملThe Property of Having a $k$-Regular Subgraph Has a Sharp Threshold
We prove that the property of containing a k-regular subgraph in the random graph model G(n, p) has a sharp threshold for k ≥ 3. We also show how to use similar methods to obtain an easy prove for the (known fact of) sharpness of having a non empty k-core for k ≥ 3.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملBounds for Random Constraint Satisfaction Problems via Spatial Coupling
We report on a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial coupling was invented as an engineering construction in the area of error correcting codes where it has resulted in efficient capacity-achieving codes for a wide range of channels. However, this technique is not limited to problems in communication...
متن کامل